Completeness and Definability of a Modal Logic Interpreted over Iterated Strict Partial Orders
نویسندگان
چکیده
Any strict partial order R on a nonempty set X defines a function θR which associates to each strict partial order S ⊆ R on X the strict partial order θR(S) = R ◦ S on X. Owing to the strong relationships between Alexandroff TD derivative operators and strict partial orders, this paper firstly calls forth the links between the CantorBendixson ranks of Alexandroff TD topological spaces and the greatest fixpoints of the θ-like functions defined by strict partial orders. It secondly considers a modal logic with modal operators 2 and 2 respectively interpreted by strict partial orders and the greatest fixpoints of the θ-like functions they define. It thirdly addresses the question of the complete axiomatization of this modal logic.
منابع مشابه
Modal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کاملThe Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general li...
متن کاملFrom Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability
This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combi...
متن کاملModal languages for topology: Expressivity and definability
In this paper we study the expressive power and definability for (extended) modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt-Thomason definability theorem in terms of the well established first-order topological language Lt.
متن کاملModal Logics for Reasoning about Multiagent Systems
It becomes evident in recent years a surge of interest to applications of modal logics for specification and validation of complex systems. It holds in particular for combined logics of knowledge, time and actions for reasoning about multiagent systems (Dixon, Nalon & Fisher, 2004; Fagin, Halpern, Moses & Vardi, 1995; Halpern & Vardi, 1986; Halpern, van der Meyden & Vardi, 2004; van der Hoek & ...
متن کامل